Introducing a graph topology for robust cooperation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Library for Graph Metaprogramming Introducing MPL.Graph

This paper describes the library MPL.Graph, which extends the Boost Metaprogramming Library into data structures and algorithms for graphs (networks). Metaprogramming shifts calculations and abstraction penalties from runtime to compile time. Graph metaprogramming is applicable to a variety of problems where some or all of the graph structure is known at compile time, e.g. class hierarchies, st...

متن کامل

Where Graph Topology Matters: The Robust Subgraph Problem

Robustness is a critical measure of the resilience of large networked systems, such as transportation and communication networks. Most prior works focus on the global robustness of a given graph at large, e.g., by measuring its overall vulnerability to external attacks or random failures. In this paper, we turn attention to local robustness and pose a novel problem in the lines of subgraph mini...

متن کامل

A Generic Scheme for Graph Topology Optimization

This research offers a fundamental new approach to topology optimization. To date, topological synthesis approaches are simply augmentations of existing stochastic optimization techniques. While these algorithms are useful in complex parametric design spaces, they are not designed for all topology problems. This paper describes a generalized scheme for solving topological design problems. The a...

متن کامل

Introducing the Graph 500

In the words of Lord Kelvin, “if you cannot measure it, you cannot improve it”. One of the longlasting successes of the Top 500 list is sustained, community-wide floating point performance improvement. Emerging large-data problems, either resulting from measured real-world phenomena or as further processing of data generated by simulation, have radically different performance characteristics an...

متن کامل

Graph Transformation for Topology Modelling

In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our proposal is motivated by the need of describing specific operations to be done on topological representations of objects in computer graphics, especially for simulation of complex structured systems where rearrangements...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Royal Society Open Science

سال: 2021

ISSN: 2054-5703

DOI: 10.1098/rsos.201958